Inter-frame Prediction with Fast Weighted Low-rank Matrix Approximation
نویسندگان
چکیده
منابع مشابه
Robust Weighted Low-Rank Matrix Approximation
The calculation of a low-rank approximation to a matrix is fundamental to many algorithms in computer vision and other fields. One of the primary tools used for calculating such low-rank approximations is the Singular Value Decomposition, but this method is not applicable in the case where there are outliers or missing elements in the data. Unfortunately this is often the case in practice. We p...
متن کاملFast Spectral Low Rank Matrix Approximation
In this paper, we study subspace embedding problem and obtain the following results: 1. We extend the results of approximate matrix multiplication from the Frobenius norm to the spectral norm. Assume matrices A and B both have at most r stable rank and r̃ rank, respectively. Let S be a subspace embedding matrix with l rows which depends on stable rank, then with high probability, we have ‖ASSB−A...
متن کاملFast Eigen Decomposition for Low-Rank Matrix Approximation
In this paper we present an efficient algorithm to compute the eigen decomposition of a matrix that is a weighted sum of the self outer products of vectors such as a covariance matrix of data. A well known algorithm to compute the eigen decomposition of such matrices is though the singular value decomposition, which is available only if all the weights are nonnegative. Our proposed algorithm ac...
متن کاملFast Implementation of Low Rank Approximation of a Sylvester Matrix
In [16], authors described an algorithm based on Structured Total Least Norm (STLN) for constructing a Sylvester matrix of given lower rank and obtaining the nearest perturbed polynomials with exact GCD of given degree. For their algorithm, the overall computation time depends on solving a sequence least squares (LS) problems. In this paper, a fast implementation for solving these LS problems i...
متن کاملAdaptive Sampling and Fast Low-Rank Matrix Approximation
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span “contains” a matrix of rank at most k with error only (1 + ) times the error of the best rank-k approximation of A. We complement it with an almost matching lower bound by constructing matrices where the span of any k/2 rows does not “contain” a relative (1 + )-approximation of rank k. Our existence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electronics and Telecommunications
سال: 2013
ISSN: 0867-6747
DOI: 10.2478/eletel-2013-0001